There Exist Some omega -Powers of Any Borel Rank
نویسندگان
چکیده
The operation V → V ω is a fundamental operation over finitary languages leading to ω-languages. Since the set Σ of infinite words over a finite alphabet Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers of finitary languages naturally arises and has been posed by Niwinski [Niw90], Simonnet [Sim92] and Staiger [Sta97a]. It has been recently proved that for each integer n ≥ 1, there exist some ω-powers of context free languages which are Π0n-complete Borel sets, [Fin01], that there exists a context free language L such that L is analytic but not Borel, [Fin03], and that there exists a finitary language V such that V ω is a Borel set of infinite rank, [Fin04]. But it was still unknown which could be the possible infinite Borel ranks of ω-powers. We fill this gap here, proving the following very surprising result which shows that ω-powers exhibit a great topological complexity: for each non-null countable ordinal ξ, there exist some Σ0ξ-complete ω-powers, and some Π 0 ξ-complete ω-powers.
منابع مشابه
en sl - 0 01 57 20 4 , v er si on 1 - 2 5 Ju n 20 07 There exist some ω - powers of any Borel rank
The operation V → V ω is a fundamental operation over finitary languages leading to ω-languages. Since the set Σ of infinite words over a finite alphabet Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers of finitary languages naturally arises and has been posed by Niwinski [Niw90], Simonnet [Sim92] and Staiger [Sta97a]. It has been recently...
متن کاملAn omega-Power of a Finitary Language Which is a Borel Set of Infinite Rank
ω-powers of finitary languages are ω-languages in the form V , where V is a finitary language over a finite alphabet Σ. Since the set Σ of infinite words over Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers naturally arises and has been raised by Niwinski [Niw90], by Simonnet [Sim92], and by Staiger [Sta97b]. It has been proved in [Fin01]...
متن کاملOn omega context free languages which are Borel sets of infinite rank
This paper is a continuation of the study of topological properties of omega context free languages (ω-CFL). We proved in [Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Volume 262 (1-2), 2001, p. 669697] that the class of ω-CFL exhausts the finite ranks of the Borel hierarchy, and in [Borel Hierarchy and Omega Context Free Languages, Theoretical Computer ...
متن کاملBorel hierarchy and omega context free languages
We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:”A Decade of Concurrency”, Springer LNCS 803 (1994), 583-621], proving topological properties of omega context free languages (ω-CFL) which extend those of [O. Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Vol. 262 (1-2),...
متن کاملAn ω-Power of a Finitary Language Which is a Borel Set of Infinite Rank
ω-powers of finitary languages are ω-languages in the form V , where V is a finitary language over a finite alphabet Σ. Since the set Σ of infinite words over Σ can be equipped with the usual Cantor topology, the question of the topological complexity of ω-powers naturally arises and has been raised by Niwinski [Niw90], by Simonnet [Sim92], and by Staiger [Sta97b]. It has been proved in [Fin01]...
متن کامل